On Routing in Circulant Graphs of Degree Four
نویسندگان
چکیده
In this paper we present the first polynomial time deterministic algorithm to compute the shortest path between two vertices of a circulant graph of degree four. Our spectacular algorithm only requires O(logN) bit operations, where N is the number of the vertices and it is based on shortest vector problems in a special class of lattices for L1-norm. Moreover, the technique can be extended to weighted and directed circulant graphs, the so called double-loop networks. Our main tools are results and methods from the geometry of numbers and computer algebra.
منابع مشابه
Gaussian Interconnection Networks
This paper explores dense Gaussian Networks, which are interconnection networks based on dense Circulant graphs of degree four. Gaussian networks exhibit better distance related characteristics than equivalent topologies such as Tori. We will show that the Gaussian integers, or the set of complex numbers with integer coefficients, constitute the appropriate mathematical model to deal with these...
متن کاملFrobenius circulant graphs of valency four
A first kind Frobenius graph is a Cayley graph Cay(K,S) on the Frobenius kernel of a Frobenius group K o H such that S = a for some a ∈ K with 〈a〉 = K, where H is of even order or a is an involution. It is known that such graphs admit ‘perfect’ routing and gossiping schemes. A circulant graph is a Cayley graph on a cyclic group of order at least three. Since circulant graphs are widely used as ...
متن کاملOn 4-valent Frobenius circulant graphs
A 4-valent first-kind Frobenius circulant graph is a connected Cayley graph DLn(1, h) = Cay(Zn, H) on the additive group of integers modulo n, where each prime factor of n is congruent to 1 modulo 4 and H = {[1], [h],−[1], −[h]} with h a solution to the congruence equation x + 1 ≡ 0 (mod n). In [A. Thomson and S. Zhou, Frobenius circulant graphs of valency four, J. Austral. Math. Soc. 85 (2008)...
متن کاملSymmetry properties of chordal rings of degree 3
This paper presents the main properties of chordal rings of degree 3. This family of graphs is strongly related to circulant graphs, which are actually often called chordal rings too. The use of triangles in the plane to represent the vertices allows one to associate a plane tessellation to every chordal ring. By using this geometrical approach, we study the recognition and the isomorphism prob...
متن کاملThe spectra of Knödel graphs
Knödel graphs Wd,n are regular graphs on n vertices and degree d. They have been introduced by W. Knödel and have been proved to be minimum gossip graphs and minimum broadcast graphs for d = blog nc. They became even more interesting in the light of recent results regarding the diameter, which is, up to now, the smallest known diameter among all minimum broadcast graphs on 2 vertices. Also, the...
متن کامل